Extracting Communities of Interests for Semantics-based Graph Searches
نویسندگان
چکیده
We propose an algorithm that divides a graph, whose vertices are users and whose edges represent shared interests, into subgraphs communities of interests (COIs). Our algorithm differs from conventional modularity-based community extraction because it introduces a mechanism to harmonize the number of users in each COI. It also attaches semantic tags to the relationships between COIs or between users based on taxonomies of the content items of interest. Our algorithm allows users to identify new interests quickly and accurately when searching their interests in the graph.
منابع مشابه
Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages
Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملExtracting Everyday Health Interests from Online Communities
Increasing numbers of patients are using online communities to seek support by posting personal stories and requesting information. To leverage this trend, we investigated Natural Language Processing (NLP) tools for extracting users’ health interests from online communities. We identified relevant semantic types of the Unified Medical Language System (UMLS) for online communities. The results s...
متن کاملBridging semantics and syntax with graph algorithms - state-of-the-art of extracting biomedical relations
Research on extracting biomedical relations has received growing attention recently, with numerous biological and clinical applications including those in pharmacogenomics, clinical trial screening and adverse drug reaction detection. The ability to accurately capture both semantic and syntactic structures in text expressing these relations becomes increasingly critical to enable deep understan...
متن کاملAn Approach to Find Related Communities Based on Bipartite Graphs
In this paper we investigate the problem of extracting related community information from a large collection of Web-pages by performing hyperlink analysis. We consider a group of communities (say related community set) related if they have common interests on some topic. In the proposed approach, we employ dense bipartite graph (DBG) abstraction for two purposes. From the given page collection,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 95-D شماره
صفحات -
تاریخ انتشار 2008